Proactive Replication and Search for Rare Objects in Unstructured Peer-to-Peer Networks

نویسندگان

  • Guoqiang Gao
  • Ruixuan Li
  • Kunmei Wen
  • Xiwu Gu
  • Zhengding Lu
چکیده

The search efficiency problem in unstructured peer-to-peer network has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve the search efficiency for rare objects. It uses object probing technique for peers to decide whether to establish replications for their objects or not when they join the network. This strategy can effectively increase the popularity of rare objects so as to enhance the search efficiency. We also present a rare object search algorithm. When a peer forwards a search request, forward probability is calculated according to its neighbors’ degree and the number of neighbors’ objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that the proactive replication strategy greatly improves the search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proactive replication for rare objects in unstructured peer-to-peer networks

Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objec...

متن کامل

Efficient Randomized Search Algorithms in Unstructured Peer-to-Peer Networks

Searching for objects in unstructured peerlo-peer (P2P) networks is an important problem, and one that has received recent attention. In this paper, we present a simple, elegant, yet highly effective technique for object location (including rare objects). Our scheme installs object references at a known numhu of randomly selected peers. A query to the object is routed to a predeIcnnined number ...

متن کامل

Review of Replication Schemes for Unstructured P2P Networks

To improve unstructured P2P system performance, one wants to minimize the number of peers that have to be probed for the shortening of the search time. A solution to the problem is to employ a replication scheme, which provides high hit rate for target files. Replication can also provide load balancing and reduce access latency if the file is accessed by a large population of users. This paper ...

متن کامل

Entropy and Search Distance in Peer-to-Peer Networks

We had previously shown that the average search distance in unstructured peer-to-peer networks having an Erdos-Renyi random graph search topology is minimized when the number of replicas of objects is proportional to the object request probabilities and this results in a minimum search distance is equal to the entropy in object request probabilities minus the logarithm of per-node cache size. I...

متن کامل

Data Search and Replication in Unstructured Peer-to-Peer Networks

The Peer-to-Peer (P2P) architectures that are most prevalent in today’s internet are decentralized and unstructured. The advantage for this type of networks is that they require no centralized directories and no process control over network topology or data placement. However, the flooding-based query strategy used in these networks does not scale. In this paper, we first introduce three basic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010